Prof. Dr. Rob van Stee

Profile

Academic position	Lecturer, Assistant Professor, Researcher
Research fields	Theoretical Computer Science,Software Engineering and Programming Languages
Keywords	Approximation algorithms, algorithmic mechanism design, bin packing, online algorithms, scheduling

Current contact address

Country	Germany
City	Siegen
Institution	Universität Siegen
Institute	Department Mathematik

Host during sponsorship

Prof. Dr. Peter Sanders	Fakultät für Informatik, Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe (TH), Karlsruhe
Start of initial sponsorship	01/07/2005

Programme(s)

2005	Humboldt Research Fellowship Programme

Publications (partial selection)

2008	Leah Epstein, Rob van Stee: Approximation schemes for packing splittable items with cardinality constraints. In: Christos Kaklamanis, Martin Skutella, Fifth Workshop on Approximation and Online Algorithms (WAOA 2007). Springer, 2008. 232-245
2008	Leah Epstein, Rob van Stee: The online unit clustering problem. In: Christos Kaklamanis, Martin Skutella, Fifth Workshop on Approximation and Online Algorithms (WAOA 2007). Springer, 2008. 193-206
2007	Leah Epstein, Rob van Stee: Improved results for a memory allocation problem. In: Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh, Tenth Workshop on Algorithms and Data Structures (WADS 2007). Springer, 2007. 362-373
2007	Leah Epstein, Asaf Levin, Rob van Stee: Multi-dimensional packing with conflicts. In: Erzsébet Csuhaj-Varjú, Zoltán Ésik, 16th International Symposium on Fundamentals of Computation Theory (FCT 2007). Springer, 2007. 288-299
2006	Leah Epstein, Rob van Stee, Tami Tamir: Paging with Request Sets. In: Lars Arge, Rusins Freivalds, Algorithm Theory - SWAT 2006, 10th Scandinavian Workshop on Algorithm Theory, Proceedings. Springer, 2006. 124-135